On the graph of a function over a prime field whose small powers have bounded degree

نویسندگان

  • Simeon Ball
  • András Gács
چکیده

Let f be a function from a finite field Fp with a prime number p of elements, to Fp. In this article we consider those functions f(X) for which there is a positive integer n > 2 √ p− 1− 11 4 with the property that f(X) , when considered as an element of Fp[X]/(X −X), has degree at most p− 2− n + i, for all i = 1, . . . , n. We prove that every line is incident with at most t − 1 points of the graph of f , or at least n + 4 − t points, where t is a positive integer satisfying n > (p − 1)/t + t − 3 if n is even and n > (p − 3)/t + t − 2 if n is odd. With the additional hypothesis that there are t − 1 lines that are incident with at least t points of the graph of f , we prove that the graph of f is contained in these t − 1 lines. We conjecture that the graph of f is contained in an algebraic curve of degree t − 1 and prove the conjecture for t = 2 and t = 3. These results apply to functions that determine less than p−2 √ p− 1+ 11 4 directions. In particular, the proof of the conjecture for t = 2 and t = 3 gives new proofs of the result of Lovász and Schrijver [7] and the result in [5] respectively, which classify all functions which determine at most 2(p− 1)/3 directions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EXISTENCE OF A STEADY FLOW WITH A BOUNDED VORTEX IN AN UNBOUNDED DOMAIN

We prove the existence of steady 2-dimensional flows, containing a bounded vortex, and approaching a uniform flow at infinity. The data prescribed is the rearrangement class of the vorticity field. The corresponding stream function satisfies a semilinear elliptic partial differential equation. The result is proved by maximizing the kinetic energy over all flows whose vorticity fields are rearra...

متن کامل

On some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...

متن کامل

A note on the order graph of a group

 The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this  graph. Also we give a relation between the order graph and prime  graph of a group.

متن کامل

Counterexamples to the Eisenbud-goto Regularity Conjecture

Abstract. Our main theorem shows that the regularity of non-degenerate homogeneous prime ideals is not bounded by any polynomial function of the degree; this holds over any field k. In particular, we provide counterexamples to the longstanding Regularity Conjecture, also known as the Eisenbud-Goto Conjecture (1984). We introduce a method which, starting from a homogeneous ideal I, produces a pr...

متن کامل

A characterization of the symmetric group of prime degree

Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$‎. ‎Recently people have been using prime graphs to study simple groups‎. ‎Naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? In this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$Gcong S_p$ if and only‎ ‎if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$‎, ‎whe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2009